On Embedding 2-Dimensional Toroidal Grids into de Bruijn Graphs with Clocked Congestion One
نویسندگان
چکیده
For integers m; d; D with m 3; d 2; and D 2, let T(m) be a 2{dimensional quadratic toroidal grid with side length m and let B(d;D) be the base d, dimension D de Bruijn graph; assume that jT(m)j = jB(d;D)j. The starting point for our investigations is the observation that, for m; D even, embeddings f : T(m) ! B(d; D) with load 1, expansion 1, and dilation D=2 can easily be found (and have previously been described in the literature). In the present paper, we pose the question whether or not there exist embeddings f : T(m) ! B(d; D) with these properties and with clocked congestion 1. We prove results implying a positive answer to this question when d is greater than two. For d = 2, we do not have a complete answer, but present partial results.
منابع مشابه
Embedding Cartesian Products of Graphs into de Bruijn Graphs
Integration of concepts for the parallelization of image processing algorithms into parallel compiler technology. Abstract Given a Cartesian product G = G 1 : : : G m (m 2) of nontrivial connected graphs G i and the n{dimensional base B de Bruijn graph D = D B (n), it is investigated whether or not G is a spanning subgraph of D. Special attention is given to graphs G 1 : : : G m which are relev...
متن کاملProducts of Networks with Logarithmic Diameter and Fixed Degree
This paper rst presents some general properties of product networks pertinent to parallel ar-chitectures and then focuses on three case studies. These are products of complete binary trees, shuue-exchange, and de Bruijn networks. It is shown that all of these are powerful architectures for parallel computation, as evidenced by their ability to eeciently emulate numerous other archi-tectures. In...
متن کاملOn the Embedding of Refinements of 2-dimensional Grids
We consider the problem of constructing embeddings of 2-dimensional FEM graphs into grids. Our goal is to minimize the edge-congestion and dilation and optimize the load. We introduce some heuris-tics, analyze their performance, and present experimental results comparing the heuristics with the methods based on the usage of standard graph partitioning libraries.
متن کاملOn the Embedding of Reenements of 2-dimensional Grids ?
We consider the problem of constructing embeddings of 2-dimensional FEM graphs into grids. Our goal is to minimize the edge-congestion and dilation and optimize the load. We introduce some heuris-tics, analyze their performance, and present experimental results comparing the heuristics with the methods based on the usage of standard graph partitioning libraries.
متن کاملEmbedding Cartesian Products of Graphs into De Bruijn Graphs Embedding Cartesian Products of Graphs into De Bruijn Graphs
(m 2) of nontrivial connected graphs G i and the n-dimensional base B de Bruijn graph D = D B (n), we investigate whether or not there exists a spanning subgraph of D which is isomorphic to G. We show that G is never a spanning subgraph of D when n is greater than three or when n equals three and m is greater than two. For n = 3 and m = 2, we can show for wide classes of graphs that G cannot be...
متن کامل